development of an efficient hybrid method for motif discovery in dna sequences

Authors

reza akbari

vahid zeighami

koorush ziarati

ismail akbari

abstract

this work presents a hybrid method for motif discovery in dna sequences. the proposed method called spso-lk, borrows the concept of chebyshev polynomials and uses the stochastic local search to improve the performance of the basic pso algorithm as a motif finder. the chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed by the basic pso algorithm. under this method, to balance between exploration and exploitation, at each iteration step, a local region is associated with each candidate particle, and a local exploration performed in this blob. the stochastic local search employs an intelligent repulsion/attraction mechanism to navigate a particle to explore this local region beyond that defined by the search algorithm to achieve a better solution. over the successive iterations, the size of local region dynamically decreases. also a non-linear dynamic inertia weight is introduced to further improve the performance of spso-lk approach. the spso-lk is tested on different sets of simulated and real nucleotide sequences to discover implanted dna motifs. experimental results show that the spso-lk is effective, and provides competitive results in comparison with the performance of other algorithms investigated in this consideration.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Development of an Efficient Hybrid Method for Motif Discovery in DNA Sequences

This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...

full text

development and implementation of an optimized control strategy for induction machine in an electric vehicle

in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...

15 صفحه اول

Finding regulatory sequences in DNA: motif discovery

The purpose of motif discovery as discussed here is to find binding sites of DNA binding regulators. We assume that the binding sites are short segments of DNA, not necessarily contiguous, to which a specific (family of) transcription factors can bind. While such sites may appear in genic as well as inter­genic regions, we focus here on finding binding sites only in the promoter region of each ...

full text

A Combinatorial Approach for Motif Discovery in Unaligned DNA Sequences

Motif (conserved pattern) modelling and finding in unaligned DNA sequences is a fundamental problem in computational biology with important applications in understanding gene regulation. Biological approaches for this problem are tedious and time-consuming. Large amounts of genome sequence data and gene expression micro-array data let us solve this problem computationally. Most computer science...

full text

Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences

We study a natural probabilistic model for motif discovery that has been used to experimentally test the quality of motif discovery programs. In this model, there are k background sequences, and each character in a background sequence is a random character from an alphabet Σ. A motif G = g1g2 . . . gm is a string of m characters. Each background sequence is implanted a randomly generated approx...

full text

An Efficient Algorithm for String Motif Discovery

Finding common patterns, motifs, in a set of DNA sequences is an important problem in bioinformatics. One common representation of motifs is a string with symbols A, C, G, T and N where N stands for the wildcard symbol. In this paper, we introduce a more general motif discovery problem without any weaknesses of the Planted (l,d)-Motif Problem and also a set of control sequences as an additional...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of electrical and electronics engineering

جلد ۴۴، شماره ۱، صفحات ۶۳-۷۵

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023